Dynamic and Fault-Tolerant Clustering for Scientific Workflows
نویسندگان
چکیده
منابع مشابه
Robust and fault-tolerant scheduling for scientific workflows in cloud computing environments
CLOUD environments offer low-cost computing resources as a subscription-based service. These resources are elastically scalable and dynamically provisioned. Furthermore, new pricing models have been pioneered by cloud providers that allow users to provision resources and to use them in an efficient manner with significant cost reductions. As a result, scientific workflows are increasingly adopt...
متن کاملFault Tolerant Clustering Revisited
In discrete k-center and k-median clustering, we are given a set of points P in a metric space M , and the task is to output a set C ⊆ P, |C| = k, such that the cost of clustering P using C is as small as possible. For k-center, the cost is the furthest a point has to travel to its nearest center, whereas for k-median, the cost is the sum of all point to nearest center distances. In the fault-t...
متن کاملFault-Tolerant Dynamic Systems
Modular redundancy (system replication) and other traditional techniques for fault tolerance in dynamic systems are expensive, and rely heavily — particularly in the case of systems operating over extended time horizons — on the assumption that the error-correcting mechanism (e.g., voting) is fault-free. Herein, we construct redundant dynamic systems in a way that achieves tolerance to transien...
متن کاملA Provenance-Based Fault Tolerance Mechanism for Scientific Workflows
Capturing provenance information in scientific workflows is not only useful for determining data-dependencies, but also for a wide range of queries including fault tolerance and usage statistics. As collaborative scientific workflow environments provide users with reusable shared workflows, collection and usage of provenance data in a generic way that could serve multiple data and computational...
متن کاملDynamic & Fault-Tolerant P2P-Topologies
Until now, the analysis of fault tolerance of peer-to-peer (p2p) systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner in p2p systems are hardly considered. Most fault tolerance analyzes are static in the sense that it is shown that a system tolerates a certain number of simultane...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cloud Computing
سال: 2016
ISSN: 2168-7161
DOI: 10.1109/tcc.2015.2427200